- closed simplex
- мат.замкнутый симплекс
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Simplex — For other uses, see Simplex (disambiguation). A regular 3 simplex or tetrahedron In geometry, a simplex (plural simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimension. Specifically, an n… … Wikipedia
Simplex algorithm — In mathematical optimization theory, the simplex algorithm, created by the American mathematician George Dantzig in 1947, is a popular algorithm for numerical solution of the linear programming problem. The journal Computing in Science and… … Wikipedia
Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… … Wikipedia
Kakutani fixed point theorem — In mathematical analysis, the Kakutani fixed point theorem is a fixed point theorem for set valued functions. It provides sufficient conditions for a set valued function defined on a convex, compact subset of a Euclidean space to have a fixed… … Wikipedia
Polygon — For other uses, see Polygon (disambiguation). Some polygons of different kinds In geometry a polygon ( … Wikipedia
Simplicial set — In mathematics, a simplicial set is a construction in categorical homotopy theory which is a purely algebraic model of the notion of a well behaved topological space. Historically, this model arose from earlier work in combinatorial topology and… … Wikipedia
Romney, Hythe and Dymchurch Railway — Romney, Hythe Dymchurch Railway Northern Chief at New Romney Overview Type Light railway Locale Ken … Wikipedia
Poincaré duality — In mathematics, the Poincaré duality theorem, named after Henri Poincaré, is a basic result on the structure of the homology and cohomology groups of manifolds. It states that if M is an n dimensional compact oriented manifold, then the k th… … Wikipedia
Numerical continuation — is a method of computing approximate solutions of a system of parameterized nonlinear equations, The parameter λ is usually a real scalar, and the solution an n vector. For a fixed parameter value λ,, maps Euclidean n space into itself. Often the … Wikipedia
Stokes' theorem — For the equation governing viscous drag in fluids, see Stokes law. Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus Derivative Change of variables Implicit differentiatio … Wikipedia
Convex polytope — A 3 dimensional convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n dimensional space Rn.[1] Some authors use the terms convex polytope and convex… … Wikipedia